منابع مشابه
Constraints, Consistency and Closure
Although the constraint satisfaction problem is NP-complete in general, a number of constraint classes have been identified for which some fixed level of local consistency is sufficient to ensure global consistency. In this paper we describe a simple algebraic property which characterises all possible constraint types for which strong k-consistency is sufficient to ensure global consistency, fo...
متن کاملConstraints , Consistency , and
Although the constraint satisfaction problem is NP-complete in general, a number of constraint classes have been identiied for which some xed level of local consistency is suucient to ensure global consistency. In this paper , we describe a simple algebraic property which characterises all possible constraint types for which strong k-consistency is suucient to ensure global consistency, for eac...
متن کاملClosure and Consistency In Logic-Associated Argumentation
Properties like logical closure and consistency are important properties in any logical reasoning system. Caminada and Amgoud showed that not every logic-based argument system satisfies these relevant properties. But under conditions like closure under contraposition or transposition of the monotonic part of the underlying logic, ASPIC-like systems satisfy these properties. In contrast, the log...
متن کاملExpensive Constraints and Hyperarc-consistency
We present an arc-consistency algorithm NAC4 to account for some types of non-binary constraints. It di ers from the generalized algorithm GAC4 [ Mohr and Masini, 1988 ] as the constraints need not be modeled as explicit relations but can be retained as implicit n-ary relations. The advantage of this algorithm over GAC4 is pronounced when the checking of constraints is expensive. By an ordering...
متن کاملA Note on Algebraic Closure and Closure under Constraints
A-closure is the equivalent of path consistency for qualitative spatiotemporal calculi with weak composition. We revisit existing attempts to characterize the question whether a-closure is a complete method for deciding consistency of CSPs over such calculi. Renz and Ligozat’s characterization via closure under constraints has been refuted by Westphal, Hué and Wölfl. However, for many commonly ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 1998
ISSN: 0004-3702
DOI: 10.1016/s0004-3702(98)00022-8